Remarks on the isomorphism theorems for weak Bernoulli transformations in general case
نویسندگان
چکیده
منابع مشابه
On Isomorphism Theorems of Fn -Polygroups
In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...
متن کاملIsomorphism Theorems for Semigroups of Order-preserving Partial Transformations
The full order-preserving transformation semigroup, the orderpreserving partial transformation semigroup and the order-preserving one-to-one partial transformation semigroup on a poset X are denoted by OT (X), OP (X) and OI(X), respectively. It is well-known that for any posets X and Y , OT (X) ∼= OT (Y ) if and only if X and Y are either order-isomorphic or order-anti-isomorphic. The purpose o...
متن کاملRemarks on the Paper ``Coupled Fixed Point Theorems for Single-Valued Operators in b-Metric Spaces''
In this paper, we improve some recent coupled fixed point resultsfor single-valued operators in the framework of ordered $b$-metricspaces established by Bota et al. [M-F. Bota, A. Petrusel, G.Petrusel and B. Samet, Coupled fixed point theorems forsingle-valued operators in b-metric spaces, Fixed Point TheoryAppl. (2015) 2015:231]. Also, we prove that Perov-type fix...
متن کاملthe test for adverse selection in life insurance market: the case of mellat insurance company
انتخاب نامساعد یکی از مشکلات اساسی در صنعت بیمه است. که ابتدا در سال 1960، توسط روتشیلد واستیگلیتز مورد بحث ومطالعه قرار گرفت ازآن موقع تاکنون بسیاری از پژوهشگران مدل های مختلفی را برای تجزیه و تحلیل تقاضا برای صنعت بیمه عمر که تماما ناشی از عدم قطعیت در این صنعت میباشد انجام داده اند .وهدف از آن پیدا کردن شرایطی است که تحت آن شرایط انتخاب یا کنار گذاشتن یک بیمه گزار به نفع و یا زیان شرکت بیمه ...
15 صفحه اولOn the Isomorphism Conjecture for Weak Reducibilities
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomialtime isomorphic to each other. In this paper, these two conjectures are investigated for reducibilities weaker than polynomial-time. It is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences
سال: 1971
ISSN: 0034-5318
DOI: 10.2977/prims/1195193398